Towards Stepwise, Schema-guided Synthesis of Logic Programms

Towards Stepwise, Schema-Guided Synthesis of Logic Programs

We present a general strategy for stepwise, sound and progressive synthesis of logic programs from specifications by examples and properties. We particularize this to schema-guided synthesis, and state a generic synthesis theorem. We justify some design choices for the development of a particular synthesis mechanism that is guided by a Divide-and-Conquer schema, is inductive and deductive, is i...

Synthesis of Composition and Discrimination Operators for Divide-and-Conquer Logic Programs

This chapter gives a brief overview of our framework for stepwise synthesis of logic programs from examples and properties. Directives are extracted for the development of a particular synthesis mechanism whose steps are guided by a divide-and-conquer schema. It features deductive and inductive reasoning. Examples and properties are presented to it in a non-incremental fashion. The objectives a...

Correctness of logic programs using proof schemes

The correctness of logic programs which are constructed by a schema-based method is presented in this paper. This schema-based method constructs typed, moded logic programs by stepwise top-down design using five program schemata, data types and modes. Correctness proofs in this approach are guided by the constructed logic programs. A proof scheme is proposed for each program schema. It is claim...

Schema-guided Synthesis of Constraint Logic Programs Supervisor: Pierre Flener

A Unified View of Programming Schemas and Proof Methods

The objectives of this investigation are (a) to study the similarities between proof planning and schema-guided programming (i.e., between proof methods and programming schemas), and (b) to express the latter in terms of the former, so as to be able to use any proof planner as an existing implementation platform for developing the first schema-guided developer of (standard or constraint) logic ...